Some codes related to BCH-codes of low dimension
نویسندگان
چکیده
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X and variants of the Griesmer construction (residual codes). 1 Review of the theory Let IFq be the ground field, F = IFq2 . Denote the interval {i, i + 1, . . . , j} ⊂ ZZ/(q−1)ZZ by [i, j]. Let A = [i, j] ⊂ ZZ/(q−1)ZZ. Interval A determines a (primitive) BCH-code C(A) of length q−1 and minimum distance ≥| A | +1. The dimension of C(A) is determined with the help of cyclotomic cosets. The cyclotomic coset containing i ∈ ZZ/(q − 1)ZZ is Z(i) = {i, qi} ⊂ ZZ/(q − 1)ZZ. We have | Z(i) |= 1 if and only if (q + 1) | i, | Z(i) |= 2 otherwise. ZZ/(q − 1)ZZ is the disjoint union of ¿the different cyclotomic cosets. The
منابع مشابه
The dimension and minimum distance of two classes of primitive BCH codes
Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, ...
متن کاملMaximum-likelihood soft decision decoding of BCH codes
The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes. as well as i...
متن کاملDimension of nonbinary antiprimitive BCH codes
Bose-Chaudhuri-Hocquenghem (BCH) codes have been widely employed in satellite communications, compact disc players, DVDs, disk drives, solidstate drives, two-dimensional bar codes and in cryptography more recently. However, there is only a little known about primitive BCH codes, let alone nonprimitive ones. In this paper, dimension of a special class of nonprimitive BCH codes of length n = q + ...
متن کاملNarrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (qm−1)/(q−1). Little is known about ...
متن کاملSome binary BCH codes with length $n=2^m+1$
Under research for near sixty years, Bose-Ray-Chaudhuri-Hocquenghem(BCH) codes have played increasingly important roles in many applications such as communication systems, data storage and information security. However, the dimension and minimum distance of BCH codes are seldom solved until now because of their intractable characteristics. The objective of this paper is to study the dimensions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 205 شماره
صفحات -
تاریخ انتشار 1999